System and method for matching one or more incoming order to a standing order based on multi-level allocation

ABSTRACT

A method of order allocation is disclosed. The method includes receiving an incoming order, establishing an inner market representing a first portion of an order book which may be defined as a function of an inner market parameter, designating the first portion of the order book as a priority and allocating the first portion of the received incoming order based on the priority, establishing an outer market that represents a second portion of the order book that includes the remainder of the order book not represented by the inner market of the order book, assigning the received incoming order to one of the inner or outer markets as a function of the inner market parameter, allocating a first portion of the incoming order to the inner market utilizing a first-in, first-out (FIFO) algorithm, and allocating a second portion, in excess of the first portion, of the incoming order to the outer market using a pro-rata algorithm.

CROSS REFERENCE TO RELATED APPLICATIONS

This patent relates to co-pending U.S. patent application Ser. No.11/729,578, titled “SYSTEM AND METHOD OF ALLOCATING AN INCOMING ORDER TOSTANDING ORDERS”, filed on Mar. 29, 2007, the content of which isincorporated herein in its entirety for all purposes.

This patent further relates to co-pending U.S. patent application Ser.No. 12/246,755, titled “SYSTEMS AND METHODS FOR MATCHING ONE OR MOREINCOMING ORDER TO A STANDING ORDER AS A FUNCTION OF AN INNER MARKETPARAMETER”, filed contemporaneously herewith; co-pending U.S. patentapplication Ser. No. 12/246,775, titled “SYSTEM AND METHOD FOR MATCHINGONE OR MORE INCOMING ORDER TO A STANDING ORDER BASED ON MULTIPLE ORDERPRIORITY”, filed contemporaneously herewith; co-pending U.S. patentapplication Ser. No. 12/246,818, titled “SYSTEM AND METHOD FOR MATCHINGONE OR MORE INCOMING ORDER TO A STANDING ORDER BASED ON MULTIPLE ORDERPRIORITY ALLOCATION”, filed contemporaneously herewith; and co-pendingU.S. patent application Ser. No. 12/246,832, titled “SYSTEM AND METHODFOR MATCHING ONE OR MORE INCOMING ORDER TO A STANDING ORDER BASED ONTIME ORDER PRIORITY ALLOCATION”, filed contemporaneously herewith, thecontents of which are incorporated herein in their entirety for allpurposes.

BACKGROUND

An exchange provides one or more markets facilitating and/or enablingthe purchase and sale of various types of products including financialinstruments such as stocks, bonds, futures contracts, options, cash, andother similar instruments. Agricultural products and commodities arealso examples of products traded on such exchanges. A futures contractis a product that is a contract for the future delivery of anotherfinancial instrument such as a quantity of grains, metals, oils, bonds,or cash. Generally, each exchange establishes, for each market providedthereby, a specification that defines at least the product(s) traded inthe market, minimum quantities that must be traded, and minimum changesin price (e.g., tick size). For some types of products (e.g., futures oroptions), the specification further defines a quantity of the underlyingproduct represented by one unit (or lot) of the product, and deliveryand expiration dates.

Products on an exchange are traded in an environment where the exchangeprovides a location for buyers and sellers to meet and negotiate a pricefor a quantity of a product. This environment may be an open outcry oron an electronic trading platform (e.g., an electronic exchange) wheretraders use software to send an order to the trading platform, or acombination of both. The order identifies the product, the quantity ofthe product the trader wishes to trade, a price at which the traderwishes to trade the product, and a direction of the order (i.e., whetherthe order is a bid to buy or an offer to sell). The trading platformmay, in turn, allocate resting orders against: aggressor orders; stoporders; market orders; limit orders and/or any other type of known orforeseeable orders. Other products are traded in an over-the-countermarket (e.g., where products are not listed on an exchange).

In an electronic trading platform, a trading host on the tradingplatform monitors incoming orders and attempts to identify (i.e., match)one or more previously received orders stored in an order book database,wherein each identified order is contra to the incoming order and has afavorable price relative to the incoming order. In particular, if theincoming order is a bid then the identified order is an offer at a pricethat is identical to or less than the bid price. Similarly, if theincoming order is an offer at a particular price, the identified orderis a bid at a price that is identical to or greater than the offerprice. Unmatched orders are placed in an open order book to awaitreceipt of a contra order, these waiting order are said to be “restingorders”.

In one embodiment, the trading host calculates an open price or“indicative opening price” for a given product based on the overlap oforders (both bids and offers) present within the trading system prior tothe market open. The mean price or indicative price will be updatedperiodically, i.e., every minute, every thirty seconds, every twominutes, etc. If the volume of the orders present within the tradingsystem prior to the market open is such that the open price could be oneof two prices, the price closest to the previous settlement price isselected to be the open price. If the trading host determines thatoverlap exists between bids and offers in a contract, the trading hosttotals the respective bids and the respective offers within thedetermined overlap range. The totaled bids are then analyzed by thetrading host to determine where and at what price the highest totalquantity on the bid “flips” or changes to a higher total quantity of theoffer. The identified price is selected to be the indicative openingprice. As previously discussed, this indicative opening price will beupdated periodically, i.e., every minute, every thirty seconds, everytwo minutes, etc., until the opening of the market upon which theindicative opening price become the open price.

Upon identification (matching) of a contra order, a minimum of thequantities associated with the identified order and the incoming orderis matched and at least the minimum quantities of each of the identifiedand incoming orders become two halves of a matched trade that is sent toa clearinghouse. The trading host considers each identified order inthis manner until either all of the identified orders have beenconsidered or all of the quantity associated with the incoming order hasbeen matched. If any quantity of the incoming order remains, an entry iscreated in the order book database and information regarding theincoming order is recorded therein.

Traders access the markets on a trading platform using trading softwarethat receives and displays at least a portion of the order book for amarket, enables a trader to provide parameters for an order for theproduct traded in the market, and transmits the order to the tradingplatform. The trading software typically utilizes a graphical userinterface to display at least a price and quantity of some of theentries in the order book associated with the market. The number ofentries of the order book displayed is generally preconfigured by thetrading software, limited by the trading platform, customized by theuser or some combination thereof. Some graphical user interfaces displayorder books of multiple markets of one or more trading platforms. Thetrader may be an individual who trades on his/her behalf, a brokertrading on behalf of another person or entity, a group, or an entity.Furthermore, the trader may be a system that automatically generates andsubmits orders.

Regardless of the specific configuration of a particular tradingplatform, each of the trading platforms will typically include one ormore matching algorithms, methods and schemes for allocating incomingorders to other incoming or resting orders. Because incoming orders willrarely be identical to, i.e., have the same quantities, prices and othervariables, the other incoming or resting orders, the algorithms, methodsand schemes are, for example, intended: to allocate orders to promoteand/or reward market makers; to assure an equitable distribution of theincoming order; and to regulate the trading volume.

I. First-In First-Out (FIFO) Algorithm

If the trading host identifies multiple orders having an identical priceand which are contra to the incoming order, assuming that the price ofthe multiple orders is favorable to the price of the incoming order, thetrading host allocates the quantity of the incoming order among suchidentified orders in accordance with prioritization and allocationalgorithms as defined in the product specification. A time priorityalgorithm such as a first-in first-out (FIFO) allocation principle oralgorithm considers each identified order sequentially in accordancewith when the identified order was received. The quantity of theincoming order is matched to the quantity of the identified orderreceived earliest, then quantities of the next earliest, and so on untilthe quantity of the incoming order is exhausted.

FIG. 1 relates to an embodiment of a FIFO allocation algorithm thatillustrates how an incoming order to sell one hundred (100) lots of aproduct at a price of 111.01/lot received by the trading host isallocated to standing orders. Table 100 shows orders A to E that thetrading host has identified in the order book that are contra to andthat have a favorable price compared to the incoming order. Rows of thetable 100 show information regarding standing orders A through E in theorder book. A column 104 shows the price of each order, a column 106shows the time each order was received, and a column 108 shows thequantity requested by each order. A column 110 shows the portion of thequantity of the incoming order allocated to each of the standing ordersA to E. In particular, the thirty (30) units requested in order A areallocated first because the order A has the most favorable price(111.03). The remaining seventy (70) units of the incoming order areallocated to the orders B to E in accordance with the time they werereceived because such orders are all at the same price. Therefore, theorders B and C are allocated fifty (50) and twenty (20) lots or units ofthe remaining seventy (70) lots or units of the incoming order,respectively. Because the quantity of the incoming order is exhausted,the remainder of the standing order C, and all of the standing orders Dand E are not allocated any portion of the incoming order and remain aresting orders in the order book.

II. Pro-Rata Algorithm

Some market specifications define the use of a pro-rata allocationalgorithm or principle, wherein a quantity of an incoming order isallocated proportionally to each of plurality of identified orders.

FIG. 2 relates to a pro-rata algorithm that illustrates an example ofhow an incoming order to sell one hundred (100) lots of a product with aprice of 111.01/lot is allocated among standing orders. As with theexample of FIG. 1, the trading host has identified orders A to E asbeing contra (i.e., orders to buy) to the incoming order and having afavorable price. Further, thirty (30) lots of the incoming order areallocated to the thirty (30) lots requested in the order A first becausethis order has the highest bid price (i.e., is most favorable).Thereafter, the remaining seventy (70) lots are allocated to the ordersB to E proportionally because these orders are at the same price. Inparticular, the trading host calculates (i) the total number of lotsrequested by the orders B to E (111 units) and (ii) calculates aproportion the quantity of each order comprises of the total. Column 202shows the proportion corresponding to each order. The trading hostcalculates the portion of the remaining quantity (70) of the incomingorder to allocate to each of the orders B to E by multiplying theproportion of the total requested by the order and the quantityremaining. Typically, the trading host rounds the calculated quantity toan integer and whether the trading host rounds up, down, or to a nearestinteger is determined by the specification for the market. In otherembodiments, if the calculated quantity is a lot of one (1), then thetrading host may be configured to not allocate any order during a firstpass. Instead, these one (1) lot fills may be allocated, for example, onsubsequent FIFO fills. Any quantity of the incoming order that remainsafter pro-rata allocation (e.g., because the trading host rounds downthe calculated quantity) is allocated to any orders that have anunfilled quantity on a FIFO basis. For example, for the order B, thetrading host multiplies the proportion of quantity requested by theorder B (i.e., 45%) by the remaining quantity (70) and thus allocatesthirty-two (32) lots of the remaining seventy (70) lots to this order.Column 204 shows the quantity of the incoming order allocated to each ofthe orders A to E.

Some trading platforms provide a priority to certain standing orders inparticular markets. An example of such an order is the first order thatimproves a price (i.e., improves the market) for the product during atrading session. To be given priority, the trading platform may requirethat the quantity associated with the order is at least a minimumquantity. Further, some trading platforms cap the quantity of anincoming order that is allocated to a standing order on the basis of apriority for certain markets. In addition, some trading platforms maygive a preference to orders submitted by a trader who is designated as amarket maker for the product. Other trading platforms may use othercriteria to determine whether orders submitted by a particular traderare given a preference. Typically, when the trading host allocates aquantity of an incoming order to a plurality of identified orders at thesame price, the trading host allocates a quantity of the incoming orderto any orders that have been given priority. The trading host thereafterallocates any remaining quantity of the incoming order to orderssubmitted by traders designated to have a preference, and then allocatesany still remaining quantity of the incoming order using the FIFO orpro-rata algorithms.

III. Price Priority Algorithm

FIG. 3 illustrates an example of allocating an incoming order to sellone hundred and ten (110) lots of a product where an order that improvedthe price is given priority. In this example, the order that is givenpriority must be for a quantity of more than twenty (20) lots and amaximum of fifty (50) lots are to be allocated to on the basis ofpriority. In addition, suppose that the order A improved the price andis for more than twenty (20) lots. For these reasons the order A isgiven priority and up to fifty (50) lots of any incoming order isallocated thereto before allocation to other orders at the same price.In particular, when an order for one hundred and ten (110) lots isreceived, fifty (50) lots are allocated to order A and the remainingquantity (60 lots) are allocated proportionally based on the quantity ofstanding orders that remains after the allocation to the order A basedon the priority thereof as described above.

IV. Pro-Rata/Minimum Allocation Quantity Algorithm

Pro-rata algorithms and principles utilized in some markets may requirethat an allocation provided to a particular order in accordance with thepro-rata algorithm must meet at least a minimum allocation quantity. Anyorders that do not meet or exceed the minimum allocation quantity areallocated to on a FIFO basis after the pro-rata allocation (if anyquantity of the incoming order remains). In the example illustrated inFIG. 4, a column 402 shows the results of a pro-rata allocation of anincoming order of one hundred and ten (110) lots among orders A to E. Acolumn 404 shows the results of applying a minimum allocation quantitythat has a value of two (2) to the pro-rata allocation. In this example,the trading host rounds fractional quantities of the pro-rata allocationto the nearest integer. Because orders A and B would be allocatedquantities that are less than the value of the minimum allocationquantity, the allocation to each of the orders A and B after applyingthe minimum allocation quantity is zero (0). The two (2) lots of theincoming order that were not allocated to orders A and B because ofapplying the minimum allocation quantity are allocated on a FIFO basisand because order A was received earliest, order A is allotted theentire remainder of two (2) lots (as shown in a column 406). In analternate embodiment, the two (2) lots of the incoming order that werenot allocated to orders A and B, i.e., the residual, may be allotted tolargest resting order that does not meet the minimum allocationquantity. In yet another alternate embodiment, all of the residual lotswhich, in this example are the two (2) lots of the incoming order thatwere not allocated to orders A and B, may be allocated to all of theremaining lots to the resting orders that did not receive an initialallocation.

The pro-rata allocation algorithm may further include priority orderfunctionality. Priority orders are orders that better a side of themarket (a.k.a. market turner). Only one order per side of the market(buy side or sell side) can be a Priority order priority, although it ispossible for neither side of the market to have a Priority orderassociated therewith. If a Priority order is present and the priceelected or associated with the Priority order is selected, then theinitial allocation is made to the Priority order. Once the quantityassociated with the Priority order has been filled, the pro-rataallocation algorithm distributes the remaining orders as discussed inconnection with FIG. 4. It will be understood that Priority orders maybe associated with a minimum order quantity or volume and/or a maximumorder quantity or cap.

V. Lead Market (LMM) Allocation Algorithm

In other embodiments a Lead Market Maker (LMM) allocation algorithm isdisclosed. The LMM designation is given to individuals chosen to make atwo-sided market in an assigned contract. The LMM designation conveys aguaranteed allocation percentage of incoming orders to the identifiedindividuals as well as pricing concessions in return for satisfyingmarket obligations. The LMM allocation algorithm has two versions: withand without Priority order functionality.

VI. LMM Allocation Algorithm with Priority Order Functionality

As previously discussed, Priority orders are orders that better a sideof the market (a.k.a. market turner). Only one order per side of themarket (buy side or sell side) can be a Priority order priority,although it is possible for neither side of the market to have aPriority order associated therewith. If a Priority order is present andthe price elected or associated with the Priority order is selected, thePriority order is matched first regardless of whether or not the orderbelongs to a designated LMM. If the Priority order belongs to an LMM,the order will be matched first and will not be included in thefollowing calculations: (1) if the LMM has a single order at an electedprice level, it will match an LMM's allocation percentage N % of theremaining incoming order quantity. However, the matched quantity willnot exceed the LMM's order quantity. (2) If the LMM has multiple ordersat an elected price level, then the LMM quantity is aggregated and willmatch N % of the remaining incoming order quantity. Multiple LMM ordersare matched on time priority basis until N % quantity allocation isfulfilled. All remaining resting orders at an elected price level (LMMas well) are matched according to time priority. In an embodiment, auser can lose their order priority (for Priority orders) when the orderis changed under any one of the following scenarios: (i) an increase inquantity; (ii) a change in price; and (iii) a change in account number.

VII. LMM Allocation Algorithm without Priority Order Functionality

In another embodiment, if the LMM has a single order at an elected orassociated price level, the LMM will match an LMM's allocationpercentage N % of the incoming order quantity. However, the matchedquantity will not exceed the LMM's order quantity. Alternatively, if theLMM has multiple orders at an elected price level, then the LMM quantityis aggregated and will match N % of the incoming order quantity.Multiple LMM orders are matched on Time Priority basis until N %quantity allocation is fulfilled. However, the LMM's allocated matchquantity cannot exceed their aggregated order size quantity. Allremaining resting orders at an elected price level (LMM included) arematched according to Time Priority. LMM allocation will not apply untilafter the market opening sequence is complete, with opening matchingoccurring on a FIFO basis. The opening price is calculated by maximizingmatch quantities in relation to buy/sell pressure.

In other embodiments, an order matching algorithm may include adistributed allocation strategy that utilizes time priority elements formarket-making orders and/or orders within a tick of the market (providedno resting orders remain at the same price). In operation, orders areinitially processed on a time priority basis, the remaining restingorders are then allocated according to the following process: (1) eachresting order at a given price receives a one lot allocation unlessthere is insufficient quantity and then the one lot allocation isconducted randomly; (2) the remaining resting orders are filled based onquantity allocation; and (3) any remaining quantity are allocated to thelargest outstanding order or orders.

U.S. Pat. No. 7,225,153 discloses digital options having demand-based,adjustable returns, and trading exchange therefor. In particular, thepatent discloses methods and systems for trading and investing in groupsof demand-based adjustable return (“DBAR”) contingent claims, includingdigital options, and for establishing markets and exchanges for suchclaims. The advantages of the discloses methods and systems, as appliedto the establishment and operation of a DBAR digital options exchange,include the ability to offer investments whose profit and loss scenariosare comparable to those for digital options or other derivatives intraditional securities markets, without the need for options orderivatives sellers or order-matching of conventional markets. A DBARdigital options exchange of the disclosed methods and systems can alsooffer conditional investments, or limit orders, in which an investmentin a state of a DBAR contingent claim (such as the price of anunderlying asset or index) can be executed or withdrawn in response tothe implied probability of the occurrence of that state.

U.S. Pat. No. 7,233,923 discloses systems and methods for matchingdesired purchases and sales of mismatched items. The disclosed systemsand methods compare the requirements of potential buyers and sellers ofitems against those of sets of other potential buyers and sellers ofitems to construct transaction sets that will enable an optimaltransaction or set of transactions for the parties involved. Thedisclosed systems and methods may be used to match purchases and salesof any items, such as goods, services, financial instruments, andproperty interests (e.g., ownership interests in real property,possessory interests in personal property, etc.).

Allocation algorithms used by the trading host for a particular marketmay affect the liquidity of the market. Specifically, some allocationalgorithms may encourage traders to submit more orders, where each orderis relatively small. Other allocation algorithms may encourage a traderto use an electronic trading system that can monitor market activity andsubmit orders on behalf of the trader very quickly and withoutintervention. As markets and technologies available to traders evolve,the allocation algorithms used by trading hosts must also evolveaccordingly to enhance liquidity and price discovery in markets.

BRIEF DESCRIPTION OF THE FIGURES

FIG. 1 illustrates an example of allocating an incoming order tostanding orders using a known FIFO algorithm;

FIG. 2 illustrates an example of allocating an incoming order tostanding orders using a known pro-rata algorithm;

FIG. 3 illustrates an example of allocating an incoming order tostanding orders in accordance with a known priority algorithm;

FIG. 4 illustrates an example of allocating an incoming order tostanding orders in accordance with a known pro-rata algorithm thatimposes a minimum allocation quantity;

FIG. 5 illustrates an embodiment of how a trading host may process anincoming order;

FIG. 6A illustrates an embodiment of how a quantity of an incoming ordermay be allocated to standing orders;

FIG. 6B illustrates another embodiment of how a quantity of an incomingorder may be allocated to standing orders;

FIG. 6C illustrates yet another embodiment of how a quantity of anincoming order may be allocated to standing orders;

FIG. 7 illustrates an embodiment of how a quantity of an incoming ordermay be allocated to standing orders that have priority;

FIG. 8 illustrates another embodiment of how a quantity of an incomingorder may be allocated to standing orders that have priority;

FIG. 9 illustrates an embodiment of allocating a quantity of an incomingorder to orders submitted by traders who are given a preference;

FIG. 10 illustrates an embodiment of how a quantity of an incoming ordermay be allocated to standing orders using a FIFO algorithm;

FIGS. 1A to 11C illustrate an embodiment of how a quantity of anincoming order may be allocated to standing orders using a pro-rataalgorithm;

FIG. 12A illustrates an example of multiple standing orders havingpriority;

FIG. 12B illustrates another example of multiple standing orders havingpriority;

FIGS. 13A and 13B illustrate an example of the priority of standingorders being changed upon receipt of an additional order;

FIGS. 14A and 14B illustrate an example of the priority of standingorders being revoked;

FIG. 15 illustrates an example of allocation of an incoming order toresting orders in accordance with priority, preferences, FIFOallocation, and pro-rata allocation;

FIG. 16A illustrates an example of allocation of an incoming orderaccording to an inner/outer market allocation algorithm;

FIGS. 16B and 16C illustrate tabular examples of allocation of anincoming order according to an inner/outer market allocation algorithm;

FIG. 17 illustrates an example of allocation of an incoming orderaccording to a priority pro-rata with multiple order priority algorithm;

FIG. 18 illustrates an example of allocation of an incoming orderaccording to a multi-level priority algorithm;

FIG. 19 illustrates an example of allocation of an incoming orderaccording to a multiple order priority algorithm;

FIG. 20 illustrates an example of allocation of an incoming orderaccording to a timed order priority algorithm; and

FIGS. 21A and 21B illustrates embodiments of systems, components anddevices that may implement the disclosed allocation algorithms, methodsand processes.

DETAILED DESCRIPTION

The present disclosure relates to systems, methods, process and devicesfor matching and allocating orders in an electronic trading environment.

I. First-In First-Out (FIFO)/Pro-Rata Split

In one embodiment a matching algorithm may be configured to allocate anincoming order according to a combination of FIFO and pro-rataprinciples. For example, a portion of an incoming order may be allocatedbased on FIFO principles while the remainder of the incoming order maybe allocated based on pro-rata principles.

FIG. 5 illustrates a FIFO matching algorithm 500 detailing a process bywhich a trading host may allocate an incoming order to identifiedorders. At block 502, the trading host may wait, or continue to wait, toreceive an order that is either a bid or an offer to buy or sell,respectively, a quantity of a product.

At block 504, in response to receiving an order, the incoming order maybe validated by the FIFO matching algorithm 500. Typically, validationincludes verifying that the trader submitting the received order isauthorized to trade in the market in which the product is traded, andthat the incoming order conforms to the specifications for the market inwhich the product trades.

At block 506, in response to a determined invalid order, the FIFOmatching algorithm 500 posts an error to the trading software utilizedby the trader submitting the order. At this point, the FIFO matchingalgorithm 500 and the trading host returns to the block 502 to wait foranother incoming order.

At block 508, in response to a determined valid order, the FIFO matchingalgorithm 500 checks or queries a database (which may be the database2116 shown in FIG. 21A) maintained by the trading host to determine ifan order book (i.e., a market) exists for the incoming order. If themarket does not exist, the FIFO matching algorithm 500 proceeds to block510, otherwise the FIFO matching algorithm 500 proceeds to block 512.

At block 510, the FIFO matching algorithm 500 may create a new orderbook for the market. At block 514, the FIFO matching algorithm 500 maycreate an entry in the newly created order book for the incoming order.The FIFO matching algorithm 500 and/or the trading host thereafterreturns to the block 502 to wait for another order to arrive.

At block 512, the specifications for the market such as, for example,traded product, delivery month, strike price, etc., may be obtained ordetermined. For example, the FIFO matching algorithm 500 queries orreads information such as the specifications for the market from adatabase (see database 2116 shown in FIG. 21A) or file structure (seememory 2120 shown in FIG. 21B) stored or maintained on computers orterminals utilized by the trading platform. In some embodiments, thedatabase that stores the specifications for the market may also storethe order book. In other embodiments, separate databases may be utilizedto store the specifications for the market and the order book. In stillother embodiments, the specifications for the market may be obtained bythe FIFO matching algorithm 500 via a network and/or Internet or othersecure connection to a remote system.

At block 516, the FIFO matching algorithm 500 sets a value Q_(remaining)to equal the quantity of products specified in the incoming orderreceived at block 502.

At block 517, the FIFO matching algorithm 500 queries the order book,which may have been established at block 510, to determine the existenceof any orders, having a favorable price, contra to the incoming order.If no such orders are identified, the FIFO matching algorithm 500proceeds to the block 514 and creates an entry for the incoming order inthe order book. If an existing order having a favorable price, contra tothe incoming order is identified, then the FIFO matching algorithm 500,at block 518 may set a FIFO percentage FIFO_(percent) that representsthe percentage of the incoming order that should be allocated using FIFOprinciples.

The FIFO matching algorithm 500 may determine the value FIFO_(percent)by querying the database (see FIG. 21A), obtaining the value fromanother communicatively connected system, receiving an input from a useror any other known or foreseeable means. In some markets, FIFO_(percent)may be fixed and defined by the market specification. In other markets,FIFO_(percent) may be varied during the course of the trading session inaccordance with metrics associated with the market. In otherembodiments, FIFO_(percent) is determined in accordance with a measureof activity in the market.

At block 518, the FIFO matching algorithm 500 may utilize the criteriaof the market specification to determine the value of FIFO_(percent.)For example, in some embodiments, the FIFO matching algorithm 500 mayset a first, large value of FIFO_(percent) when there are many orders inthe market, and a second, low (or lower) value of FIFO_(percent) whenthere are few orders in the market. In an embodiment, a high value ofFIFO_(percent) may be utilized if the sum of the quantities associatedwith the orders in the market at the best price is high; otherwise, arelatively low value of FIFO_(percent) may be utilized. In anotherembodiment, the FIFO_(percent) may be determined dynamically as thenumber of orders in the market or the quantities associated with theorders varies. It will be understood, that other metrics and indicatorsof market activity may be utilized in other embodiment to determine thevalue of FIFO_(percent).

At block 520, the FIFO matching algorithm 500 may determine Q_(FIFO),that is the quantity of the incoming order that is to be allocated usinga FIFO algorithm, by multiplying Q_(remaining) with FIFO_(percent.) Itshould be apparent that if FIFO_(percent) is one-hundred percent (100%)then the FIFO matching algorithm 500 implemented by the trading hostexclusively utilizes FIFO principles to allocate the quantity of theincoming order. In addition, if the value of FIFO_(percent) is zeropercent (0%) then none of the quantity the incoming order is allocatedutilizing the FIFO algorithm and the entire quantity is allocated usingpro-rata principles and/or algorithms described above or otheralgorithms designated for the market.

At block 522, the FIFO matching algorithm 500 identifies and selects allof the orders from the order book that have the best price and that havenot had any quantity of the incoming order allocated thereto.

At block 524, the FIFO matching algorithm 500 allocates Q_(remaining)the quantity of the product specified by the incoming order. Uponcompletion of the allocation, Q_(remaining) is updated to reflect theallocated quantity.

At block 526, the FIFO matching algorithm 500 updates the order bookcorresponding to each of the identified and selected orders discussed inconnection with block 522 to reflect the allocated allocation receivedfrom the incoming order.

At block 528, the FIFO matching algorithm 500 and the trading hostreports, for each of the identified and selected orders to which aportion of the incoming order was allocated, a match between theselected order and the incoming order to the clearinghouse, the traderwho submitted the selected order, and the trader who submitted theincoming order. In an embodiment, the match may be recorded in adatabase maintained by the trading platform.

At block 530, the FIFO matching algorithm 500 may check to determine ifthe order quantity represented by Q_(remaining) is greater than zero. Ifthe determined value of Q_(remaining) is greater than zero (i.e., thequantity of the incoming order has not been exhausted) then, the FIFOmatching algorithm 500 proceeds to the block 517 to determine theexistence of any remaining orders, having a favorable price, contra tothe incoming order. If the determined value of Q_(remaining) equals thanzero (0), then the FIFO matching algorithm 500 may proceed to block 502to wait for another incoming order.

A. Price Allocation Algorithm

In one embodiment a matching algorithm may be configured to allocate anincoming order according to a price priority criterion in conjunctionwith FIFO and pro-rata principles. For example, an incoming order or aportion of an incoming order may be identified as having a best or highprice and may, in turn, be designated as a price priority order. Lotsmay then be initially allocated based on the price priority while theremainder of the incoming order may be allocated based on, for example,a preference criterion, FIFO and/or pro-rata principles.

FIG. 6A illustrates a price allocation algorithm 600 that may beimplemented at the block 524 (see FIG. 5) of the FIFO matching algorithm500. The price allocation algorithm 600 details another matching orallocation scheme for allocating or distributing the orders representedby Q_(remaining) according to the best price.

At block 602, the price allocation algorithm 600 may determine whethermore than one (1) order has been selected. If a single order isselected, then at block 604 the price allocation algorithm 600determines a quantity of the incoming order that is to be matchedQ_(matched) to the contra or resting order. Q_(matched) may becalculated determining the minimum of the quantity of product specifiedby the selected order Q_(order) and the quantity of the incoming orderthat remains to be allocated Q_(remaining).

At block 606, the price allocation algorithm 600 updates the valueQ_(remaining) by subtracting the value Q_(matched).

At block 607, the price allocation algorithm 600 updates the quantity ofthe selected order that remains Q_(order) by subtracting Q_(matched).Upon completion of the processing represented by the block 607, it willbe apparent one of the values Q_(matched) or Q_(remaining) will equalzero (0). The price allocation algorithm 600 may proceed to block 610where the matching or allocation to the selected order is complete andother orders may be considered.

At block 611, the price allocation algorithm 600, allocates the quantityof the incoming order Q_(remaining) to the selected orders in accordancewith any priority criteria defined by the market specification for theproduct.

At block 612, the price allocation algorithm 600, determines if anyquantity of the incoming order represented by Q_(remaining) remainsunfilled. If none remain, the price allocation algorithm 600 may proceedto block 610 where the matching or allocation to the selected order iscomplete and other orders may be considered.

At block 613, the price allocation algorithm 600, if Q_(remaining) isgreater than zero, allocates the remaining quantity to standing orderssubmitted by traders designated to have a preference.

At block 614, the price allocation algorithm 600 determines if anyquantity of the incoming order represented by Q_(remaining) remains tobe allocated. If none remain, the price allocation algorithm 600 mayproceed to block 610 where the matching or allocation to the selectedorder is complete and other orders may be considered.

At block 616, the price allocation algorithm 600 allocates the remainingquantity of the incoming order in a number of lots up to the valueQ_(FIFO) of the incoming order to the selected orders using the FIFOalgorithm. Upon completion of the allocation, the price allocationalgorithm 600 adjusts the values Q_(FIFO) and Q_(remaining) accordingly.

At block 618, the price allocation algorithm 600 determines if anyquantity of the incoming order represented by Q_(remaining). If noneremain, the price allocation algorithm 600 may proceed to block 610where the matching or allocation to the selected order is complete andother orders may be considered.

At block 620, the price allocation algorithm 600 allocates the remainingquantity Q_(remaining) utilizing the pro-rata algorithm.

At the block 610 the price allocation algorithm 600 returns to theimplementing block or point, in the present example block 524 shown inFIG. 5.

B. Alternate Price Allocation Algorithm

In one embodiment a matching algorithm may be configured to allocate anincoming order according to a preference criterion in conjunction withFIFO and pro-rata principles. For example, an incoming order or aportion of an incoming order may be identified as having a best or highprice and may, in turn, be designated as a price priority order. Lotsmay then be initially allocated based on the price priority while theremainder of the incoming order may be allocated based on a preferencecriterion associated with, for example, a preferred trader, and theremainder of the incoming order may be allocated based on FIFO and/orpro-rata principles.

FIG. 6B illustrates an alternate price allocation algorithm 630 whichmay be implemented in connection with the price allocation algorithm 600illustrated in FIG. 6A. Specifically, alternate price allocationalgorithm 630 allocates a remaining quantity of an incoming order toorders submitted by preferred traders before allocating any remainingquantity of the incoming order to orders based on priority. In thisembodiment, blocks 611 to 613 of the price allocation algorithm 600illustrated in FIG. 6A may be replaced by blocks 632 to 636 of thealternate price allocation algorithm, 630. Thus, if the price allocationalgorithm 600 illustrated in FIG. 6A determines that more than one orderhas been selected then processing proceeds to the block 632, whichallocates the quantity Q_(remaining) of the incoming order to thoseselected orders submitted by preferred traders (e.g., according to thealternate price allocation algorithm 630).

At block 634, the alternate price allocation algorithm 630 may determineif any quantity of the incoming order represented by Q_(remaining). Ifnone remain, the alternate price allocation algorithm 630 may proceed toblock 610 when the matching or allocation to the selected order iscomplete and other orders may be considered as illustrated in FIG. 6A.

At block 636, the alternate price allocation algorithm 630 allocates anyquantity of the incoming order represented by Q_(remaining) on the basisof priority. The alternate price allocation algorithm then proceeds toblock 614 illustrated in FIG. 6A.

C. Pro-Rata Allocation Algorithm

In one embodiment a matching algorithm may be configured to allocate anincoming order according to a combination of pro-rata principles andFIFO principles. For example, an incoming order or a portion of anincoming order may be initially allocated based on pro-rata principleswhile the remainder of the incoming order may be allocated based on FIFOprinciples.

FIG. 6C illustrates a pro-rata allocation algorithm 650 which may beimplemented in connection with the price allocation algorithm 600illustrates in FIG. 6A. In particular, the exemplary pro-rata allocationalgorithm 650 allocates a remaining quantity of the incoming order usingthe pro-rata algorithm before allocating a quantity of the incomingorder using FIFO principles or algorithms. In this embodiment, theblocks 652 to 658 of the pro-rata allocation algorithm 650 may beexecuted in place of blocks 616 to 620 of the price allocation algorithm600 illustrates FIG. 6A.

At block 652, the pro-rata allocation algorithm 650 determines a valueof Q_(prorata) that is to be allocated using the disclosed pro-rataalgorithm or scheme. In an embodiment, Q_(prorata) may be the differencebetween Q_(remaining) and Q_(FIFO). In another embodiment, Q_(prorata)may be developed in a manner similar to the development of the valueQ_(FIFO) described herein above.

At block 654, the pro-rata allocation algorithm 650 allocates a quantityequal to Q_(prorata) of the incoming order to the selected orders usingthe pro-rata algorithm.

At block 656, the pro-rata allocation algorithm 650 determines if anyquantity of the incoming order remains and, if any quantity does remain,the algorithm may proceed to block 658. If none remain, the pro-rataallocation algorithm 650 may proceed to block 610 when the matching orallocation to the selected order is complete and other orders may beconsidered as illustrated in FIG. 6A.

At block 658, the pro-rata allocation algorithm 650 allocates theremaining quantity Q_(remaining) to the selected orders using the FIFOalgorithm and may proceed to block 610 illustrated in FIG. 6A.

D. Priority Allocation Algorithm

In one embodiment a matching algorithm may be configured to allocate anincoming order according to a price priority criterion in conjunctionwith FIFO and pro-rata principles. For example, an incoming order or aportion of an incoming order may be designated as a price priority orderif it is determined to be one of the first three (3) orders that improvethe price, and lots may be allocated a function of the price priority.

FIG. 7 illustrates an embodiment of a priority allocation algorithm 700configured to allocate the remaining quantity Q_(remaining) of theincoming order to the selected contra or standing orders that have apriority associated therewith. The priority allocation algorithm 700 maybe implemented, for example, at the block 611 of the price allocationalgorithm 600 illustrated in FIG. 6A. In this exemplary embodiment, thepriority allocation algorithm 700 and the trading host may track aquantity of orders allocated based on a priority (N_(priority)) within amarket during a trading session. For example, the market specificationmay define that the first three orders that improve the price during atrading session are to have priority. At the start of the tradingsession, the value of N_(priority) may be set to three (3) by thepriority allocation algorithm 700 and trading host. N_(priority) may bedecremented for each order that is allocated a quantity of an incomingorder because of priority.

At block 704, priority allocation algorithm 700 sets a value of acounter i to 1.

At block 706, the priority allocation algorithm 700 identifies anyorders among the selected orders (e.g., those orders selected oridentified block 522 illustrated in FIG. 5) that have a priorityassociated therewith.

At block 708, the priority allocation algorithm 700 sets a value to thenumber N of the priority orders identified at block 706.

At block 710, the priority allocation algorithm 700 determines if thereare additional priority orders to be considered (i<=N) and if there is aremaining quantity of the incoming order to allocate (Q_(remaining)>0).If additional priority orders do not exist and/or no quantity of theincoming order remains to be allocated, the priority allocationalgorithm 700 proceeds to block 714 to continue allocating the remainingquantity of the incoming order.

At block 712, the priority allocation algorithm 700, upon determiningthe existence of additional orders and quantities to allocate, sets avalue Q_(order) to equal the quantity requested by the i^(th) priorityorder. In an embodiment, the priority orders are selected sequentiallyin accordance with the time when each priority order was received. Inanother embodiment, the priority orders are selected in accordance withtrader status. Other methods, scheme or algorithms of selecting thepriority orders may be apparent to those with skill in the art.

At block 713, the priority allocation algorithm 700 determines if thevalue of Q_(order) is greater than or equal to a minimum quantitymin_(priority) necessary to have a portion of the incoming orderallocated in accordance with the priority. The value of min_(priority)is typically defined by the market specification. If the value ofQ_(order) is at least min_(priority) then processing proceeds to a block716; otherwise processing proceeds to the block 717.

At block 716, upon determining that Q_(order) is greater than or equalto the minimum quantity min_(priority) the priority allocation algorithm700 determines a value of Q_(matched) to allocate to the i^(th) priorityorder. Q_(matched) is determined by calculating the minimum of thequantity of the i^(th) priority order and the quantity that remains ofthe incoming order.

At block 718, Q_(matched) is subtracted from Q_(order) to calculate thequantity of the i^(th) priority order that remains.

At block 720, the priority allocation algorithm 700 calculates theremaining quantity Q_(remaining) of the incoming order by subtractingQ_(matched) from the Q_(order).

At block 722, the priority allocation algorithm 700 sets the quantityremaining Q_(remaining) of the i^(th) priority order to equal Q_(order).

At block 717, the value of the counter i is incremented.

E. Alternate Priority Allocation Algorithm

In one embodiment a matching algorithm may be configured to allocate anincoming order according to a priority criterion based on a quantityvalue. For example, if the priority criterion is based on a quantity offive orders, lots may be allocated to each of the five orders accordingto FIFO, pro-rata or any other allocation principle or algorithm.

FIG. 8 illustrates an alternate priority allocation algorithm 800 tocontrol the allocation of an incoming order to one or more selectedorders having an assigned priority such that a maximum of apredetermined quantity (Q_(priority)) of the remaining quantityQ_(remaining) are allocated to selected orders based on the priority.

At block 802, that alternate priority allocation algorithm 800determines, queries a database or otherwise looks up the value ofQ_(priority) that may be allocated in accordance with the priority. Inan embodiment, the alternate priority allocation algorithm 800 and thetrading host tracks the number of lots within a market and during atrading session that may be allocated based on a priority. The value ofQ_(priority) may be stored in a database of the trading host. The valueof Q_(priority) may be decremented as incoming orders are allocated toorders in accordance with a priority. In another embodiment, thealternate priority allocation algorithm 800 and/or the trading host setsQ_(priority) to a predetermined value defined by the trading platformfor a particular market.

At block 804, the alternate priority allocation algorithm 800initializes the value of a counter i to 1.

At block 808, the alternate priority allocation algorithm 800 sets thevalue of a variable N to equal to the number of orders identified ashaving a priority associated therewith.

At block 810, the alternate priority allocation algorithm 800determines: (1) the existence of any remaining priority orders (i<=N);(2) existence of any predetermined quantity of unallocated priorityorders (Q_(priority)>0); and (3) existence of any remaining quantityQ_(remaining) of the incoming order to be allocated.

If any of the conditions (1) to (3) are false or otherwise do not occurand/or exist, the alternate priority allocation algorithm 800 proceedsto block 814 and stores the quantity of Q_(priority)

If all three conditions are true, the alternate priority allocationalgorithm 800 proceeds to block 812 and sets the value of Q_(order) tothe quantity of the i^(th) priority order. In an embodiment, priorityorders are considered in the order in which each priority order wasreceived. In other words, the first priority order that may be selectedby the alternate priority allocation algorithm 800 may be the priorityorder received earliest.

At block 813, the alternate priority allocation algorithm 800 comparesthe value of Q_(order) with the value min_(priority) to determine if thevalue Of Q_(order) is sufficient to be considered for allocation. If thevalue of Q_(order) is less than min_(priority), then at block 817 thecounter i increments.

If the value of Q_(order) is at least min_(priority) then processingproceeds to a block 816; otherwise processing proceeds to a block 817.

At block 816, upon determination that the value Of Q_(order) is at leastmin_(priority), the alternate priority allocation algorithm 800calculates a matched quantity Q_(matched) that is the amount of theremaining quantity Q_(remaining) to allocate to the i^(th) priorityorder without exceeding Q_(priority).

At blocks 818, 820, and 822, the alternate priority allocation algorithm800 subtracts the value Q_(matched) from the values Q_(order),Q_(remaining) and Q_(priority), respectively to reflect the quantityallocated to the i^(th) order.

At block 824, the alternate priority allocation algorithm 800 sets thequantity of the i^(th) order to Q_(order).

At block 817, the alternate priority allocation algorithm 800 mayincrement the counter i and proceeds to the block 810.

At block 814, the alternate priority allocation algorithm 800 stores thequantity of Q_(priority) and allocation of the remaining quantityQ_(remaining) of the incoming order to the selected orders on the basisof priority is completed.

F. Preferred Trader Allocation Algorithm

In one embodiment a matching algorithm may be configured to identifyorders received from a preferred trader as priority orders. For example,if an incoming order is recognized as an order from a trader identifiedas a preferred trader, then lots may be allocated to the priority ordersaccording to FIFO, pro-rata or any other allocation principle oralgorithm.

FIG. 9 illustrates a preferred trader allocation algorithm 900 thatallocates, on the basis of preferences provided to traders, theremaining quantity Q_(remaining) of the incoming order to the ordersselected and identified at block 522 (see FIG. 5) and that have anunfilled quantity associated therewith.

At block 902, the preferred trader allocation algorithm 900 sets acounter value i to 1.

At block 904, the preferred trader allocation algorithm 900 identifiesorders submitted by traders who are provided with, assigned or otherwiseearn and/or acquire a preference and/or a priority status.

At block 906, the preferred trader allocation algorithm 900 sets thevalue of number of orders N to equal the identified orders at block 904.

At block 908, the preferred trader allocation algorithm 900 sets thevalue of the quantity variable Q to equal Q_(remaining).

At block 910, the preferred trader allocation algorithm 900 analyzes theorder book to determine if orders from one or more preferred tradersremain and the quantity of the incoming order remains. If no furtherorders from preferred traders remain and/or none of the quantity of theincoming order remains then, at block 914, the preferred traderallocation algorithm 900 continues allocating any remaining quantity ofthe incoming order.

At block 912, the preferred trader allocation algorithm 900 sets a valueof the variable Q_(order) to equal the quantity of the i^(th) orderidentified at block 904.

At block 916, the preferred trader allocation algorithm 900 identifies avalue for a variable (R) that represents a predetermined portion of theincoming order to which the preferred trader is entitled and that mayvary from trader to trader. In an embodiment, if the preferred traderhas submitted multiple orders at the same price, the trading host and/orthe preferred trader allocation algorithm 900 insures that the totalallocation to the preferred trader does not exceed the predeterminedportion by adjusting the value of the variable R accordingly.

At block 918, the preferred trader allocation algorithm 900 determines avalue that represents the quantity of the incoming order to be matchedto the i^(th) order matched quantity Q_(matched) by calculating theminimum of the quantity of the i^(th) order and the product of the valueof the variable R and the value of the variable Q.

At blocks 920 and 922, the value of the matched quantity Q_(matched) maybe subtracted from the values Q_(order) and Q_(remaining), respectively.

At block 924, the preferred trader allocation algorithm 900 sets thevalue of the i^(th) order to equal the value stored by the variableQ_(order) and updates the order database to reflect the match.

At block 926, the preferred trader allocation algorithm 900 incrementsthe value of the counter i and processing may return to the analysisstep represented the block 910.

G. Selected Order FIFO Allocation Algorithm

In one embodiment a matching algorithm may be configured to allocatelots to selected orders according to FIFO principles. For example, thematching algorithm may identify a number of orders based on a predefinedcriterion. Lots may, in turn, be allocated to the identified ordersaccording to FIFO principles up to, for example, a given quantity.

FIG. 10 illustrates a selected order FIFO allocation algorithm 1000 thatshows how the quantity Q_(FIFO) of the incoming order is allocated toselected orders using the FIFO algorithm.

At block 1002, the FIFO allocation algorithm 1000 sorts the selectedorders in accordance with the time each order was received.

At block 1004, a counter variable i may be set or assigned a value equalto one (1).

At block 1006, the FIFO allocation algorithm 1000 may set a value of thenumber of orders (N) variable to equal the actual, selected number oforders.

At block 1008, the FIFO allocation algorithm 1000 sets a value of thequantity of the product specified Q_(order) variable to equal the actualquantity of the product specified in i^(th) order of the sorted andselected orders.

At block 1010, the quantity of the product specified calculates thequantity of the incoming order to allocate to the i^(th) order using aFIFO algorithm. For example, the FIFO allocation algorithm 1000 sets thematched quantity Q_(matched) to equal the minimum of the quantity of theincoming order that remains to be allocated (Q_(remaining)), thequantity of orders that may be allocated using the FIFO algorithm(Q_(FIFO)), and the quantity of the i^(th) order (Q_(order)).

At blocks 1012, 1014, and 1016, the FIFO allocation algorithm 1000subtracts the value of matched quantity Q_(matched) from the values ofQ_(order), Q_(remaining), and Q_(FIFO) respectively, to reflect thequantity of the incoming orders that is allocated to the i^(th) order.

At block 1018, the quantity that remains of the i^(th) order may be setto Q_(order).

At block 1020, the FIFO allocation algorithm 1000 may increment thevalue represented by the counter variable i by one (1) thereby allowingthe FIFO allocation algorithm 1000 at the block 1008 to select the nextorder received for allocation.

At block 1022, the FIFO allocation algorithm 1000 may branch or continueto the block 1008 if any quantity of the incoming order remains that canbe allocated using the FIFO algorithm (Q_(FIFO)>0) and if anotherselected order need to be considers (i<=N). If these conditions are notsatisfied, the FIFO allocation algorithm 1000 returns to the callingblock (e.g., the block 616 shown in FIG. 6A).

H. Selected Order Pro-Rata Allocation Algorithm

In one embodiment a matching algorithm may be configured to allocatelots to selected orders according to pro-rata principles. For example,the matching algorithm may identify a number of orders based on apredefined criterion. Lots may, in turn, be allocated to the identifiedorders according to pro-rata principles up to, for example, a givenquantity.

FIGS. 11A to 11C illustrate an exemplary selected order pro-rataallocation algorithm 1100 configured to allocate the remaining quantityQ_(remaining) of an incoming order to one or more selected orders inaccordance with the pro-rata algorithm. For example, the selected orderpro-rata allocation algorithm 1100 may represent, compliment and/orreplace the processing executed at blocks 614, 616 and/or 620 shown inFIG. 6A.

At block 1102, a sum of the quantities of selected orders Q_(sum) may becalculated based on an actual/determined sum of the quantities of theselected orders.

At block 1104, the number of selected orders N may be determined andassigned.

At block 1106 a counter variable i is set or assigned a value equal toone (1).

At block 1108, the selected order pro-rata allocation algorithm 1100 maydetermine the quantity of the i^(th) selected order.

At block 1110, the selected order pro-rata allocation algorithm 1100 maycalculate a proportion that the quantity of the i^(th) selected ordercomprises of the total of the quantities of the selected orderQ_(portion).

At block 1112, the counter variable i may increment or increase thecounter value by one (1).

A block 1114, the selected order pro-rata allocation algorithm 1100 maycompare the counter variable i to the number of selected orders N and,if the value of counter variable i is less than the value of theselected orders N continues, branches or returns to the block 1108.However, if the value of the counter variable i is greater than thevalue of the selected orders N, the selected order pro-rata allocationalgorithm 1100 may proceed to the block 1116 (see FIG. 11B) where thevalue of the counter variable i is reset to equal one (1).

FIG. 11B, which continues on from FIG. 11A, depicts that the selectedorder pro-rata allocation algorithm 1100, at block 1118, calculates avalue for the pro-rata quantity Q_(prorata) that is the minimum of thetotal of the quantities of the selected orders Q_(sum) and the remainingquantity Q_(remaining).

At block 1120, the selected order pro-rata allocation algorithm 1100sets the value of the variable matched to equal zero (0).

At block 1122, the value of a matched quantity Q_(matched) which equalsthe quantity of the incoming order to be allocated to the i^(th)selected order may be calculated by multiplying the proportion of the iselected order (Q_(portion)[i]) and the value of the pro-rata quantityQ_(prorata). In an embodiment, the product of Q_(portion)[i] andQ_(prorata) may be rounded down to the nearest integer by truncating anyfraction portion thereof. In another embodiment, the product may berounded up to the next higher integer if the fractional portion of theproduct is greater than 0.5 and down to the preceding lower integerotherwise. Other rounding schemes that may be used are known to thoseskilled in the art.

At block 1124, the value of the matched quantity Q_(matched) may becompared to a value of the minimum allocation quantity (MAQ) that isdefined for the market. For example, the value of the MAQ may be definedin the specification for the market. If the matched quantity Q_(matched)is greater than the value of the MAQ then at block 1126, the selectedorder pro-rata allocation algorithm 1100 may set Q_(order) to equal thequantity associated with the i^(th) order. Alternatively, if the valueQ_(matched) is less than the value of the MAQ, then the selected orderpro-rata allocation algorithm 1100 may proceed to block 1136.

At block 1128, the selected order pro-rata allocation algorithm 1100adds the value of Q_(matched) to the value of the variable matched whichwas initialized at block 1120.

At block 1130, the value of the variable Q_(matched) may be subtractedfrom the value of the variable Q_(order).

At block 1132, the selected order pro-rata allocation algorithm 1100 mayset the quantity of the i^(th) order to equal the value of the variableQ_(order).

At block 1134, the counter variable i may increment or increase thecounter value by one (1).

At block 1136, the selected order pro-rata allocation algorithm 1100 maydetermine or evaluate if the value of the variable matched is less thanthe value of the variable Q_(prorata), and if the value of the countervariable i is less than or equal to the number of selected orders (N).If both comparisons are determined to be true, then the selected orderpro-rata allocation algorithm 1100 proceeds to block 1122 to continueallocating the incoming order to the remaining selected orders. If oneor both of the comparisons false (or un-true), then the selected orderpro-rata allocation algorithm 1100 may proceed to block 1138 (see FIG.11C) to allocate any quantity of the incoming order that was notallocated.

FIG. 11C, which continues on from FIG. 11B, depicts that the selectedorder pro-rata allocation algorithm 1100, at block 1138 may calculate avalue of the variable remainder that is the difference between thequantity that could have been allocated using the prorata algorithm(Q_(prorata)) and the quantity that actually was allocated process stepsor procedures represented by the blocks 1122 to 1136 (represented by thevariable matched). The value of the variable remainder represents thequantities not allocated because of rounding or because a valueQ_(matched) was less than the value of the minimum allocation quantity.

At block 1140, the selected order pro-rata allocation algorithm 1100 maysort the selected orders. In an embodiment, the selected orders may besorted in accordance with the time when each order was received. Inanother embodiment, the selected orders may be sorted in accordance withthe portion of the sum of the quantities of all of the selected ordersrepresented by the quantity of each selected order.

At block 1142, the counter variable i may be reset to a value of one(1).

At block 1144, the selected order pro-rata allocation algorithm 1100 mayevaluate if any quantity of the variable remainder needs to be allocated(i.e., that the value remainder is greater than 0), and if all of theselected orders have been considered (i.e., that value of the counter iis less than or equal to the value N). If both evaluations are true, theselected order pro-rata allocation algorithm 1100 may proceed to block1146. However, if one or more are false (or un-true), then the selectedorder pro-rata allocation algorithm 1100 may proceed to block 1148. Atblock 1148, the selected order pro-rata allocation algorithm 1100 maycalculate the remaining quantity Q_(remaining) of the incoming orderafter the allocation process discussed in connection with the blocks1102 to 1156. For example, the value of the variable Q_(remaining) whichrepresents the remaining quantity, may be decreased by the value of thevariable matched and the value of the variable remainder. Thereafter,process may resume with the selected order pro-rata allocation algorithm1100 returning to point at which the pro-rata allocation algorithm wasinitiated, e.g., the block 620.

At block 1146, the value of the variable Q_(order) may be set to equalto any remaining quantity of the i^(th) order (as sorted by the block1140).

At block 1149, the value of the variable Q_(matched) may be calculatedor determined based on the minimum of the value of the variableQ_(order) and value of the variable remainder.

At block 1150, the value of the variable Q_(matched) may be subtractedfrom the value of the variable Q_(order) and the result, in turn, may beset as the value of Q_(order).

At block 1152, the selected order pro-rata allocation algorithm 1100 mayset the value of the variable remainder to equal the result ofsubtracting the value Q_(matched) from the current value of the variableremainder.

A block 1154 set the quantity associated with i^(th) order to the valueQ_(order).

At block 1156, the counter variable i may increment or increase thecounter value by one (1) and the selected order pro-rata allocationalgorithm 1100 may proceed to block 1144.

II. Multiple Order Priority

A. Priority for Orders that Improve a Market

In one embodiment a matching algorithm may be configured to designate apredefined number of orders as priority orders if the orders aredetermined to improve the market and/or satisfy a minimum orderquantity.

Some embodiments allow more than one order to have priority. FIG. 12Ashows a table 1200 of exemplary standing orders in a market. For thisexample, the first three (3) orders that improve the market and thatrequest an order quantity of at least twenty (20) lots are givenpriority. In addition, the maximum quantity of an incoming order that isallocated to each order based on the priority is fifty (50).

Column 1202 indicates the time of receipt of each order. Columns 1204and 1206 show the price and quantity requested by each order listed incolumn 1202, respectively. As shown in the column 1204, each of theorders has an identical price and this example assumes this is the bestprice for the market.

Column 1208 shows a quantity of each order filled based on priority.Although the earliest received order is order A, no portion of order Amay be filled based on priority because this order does not meet theminimum quantity criterion of twenty (20) lots. Orders B to D are givenpriority because these are the first three orders to improve the marketand that meet the minimum quantity criterion. Furthermore, up to fifty(50) lots of the orders C and D may be allocated based on priority.

B. Priority as a Function of Min/Max Quantity

In one embodiment a matching algorithm may be configured to designate apredefined number of orders as priority orders if the orders aredetermined to improve the size and/or volume of the market.

FIG. 12B shows a table 1210 that depicts how an exemplary market mayprovide priority to standing orders that improve the market based on apredefined quantity. For example, an order that includes a quantity ofone hundred and twenty (120) lots may be distributed or allocated to oneor more standing bid orders (orders A to E) if the standing orderssatisfy a minimum quantity requirement of twenty (20) lots, then theyare prioritized and may receive up to a maximum of fifty (50) lots perorder.

Column 1211 identifies when each order A to E was received. Column 1212shows the price associated with each of the orders A to E. Column 1214shows the quantity requested by each of the orders A to E. Column 1216shows the distribution and/or allocation of the 120 lots to theprioritized orders A to E. Specifically, order A does not receive anypriority because order A does not meet the minimum requirement. Thirty(30) lots of order B may be allocated on the basis of priority. Amaximum quantity of fifty (50), out of the ninety-five (95) lotsrequested by order C, may be allocated on the basis of priority becausefifty (50) is the maximum. All of the thirty (30) lots requested byorder D may be allocated on a priority basis. Of the fifty (50) lotsrequested by order E, only ten (10) lots may be allocated based onpriority because the quantity available for priority is exhausted. Note,if the trading host receives a second or subsequent matching incoming(sell) order having a quantity of at least one-hundred (100) lots, thetrading host may allocate forty-five (45) lots of the incoming order toorder C, forty (40) lots to order E, and then the remaining fifteen (15)lots to order A.

C. Retention of Priority for Orders that Improve a Market

In one embodiment a matching algorithm may be configured to designate anorder as a priority order if the order is determined to improve themarket, and the priority is maintained even if another order is receivedand is designated a priority order.

Some embodiments may allow orders that are designated as priority ordersfor improving the market, may retain the designated priority even if themarket is further improved by subsequent orders. FIG. 13A shows a table1300 of representative standing orders A to D to sell a product in amarket. In this example, as many as three (3) orders that improve themarket may be designated as priority orders and each priority order maybe allocated the maximum quantity of fifty (50) lots, if the identifiedorders are for at least the minimum quantity of twenty (20) lots.

Column 1302 shows the time of receipt of each order. Columns 1304 and1306 show the price and quantities of each order, respectively. In thisexample, the price of each of the orders A to D is identical. Column1306 shows the quantity of each of the orders A to D that is eligible tobe allocated based on priority. In particular, orders B to D aredesignated as priority orders while order A does not satisfy the minimumquantity requirement and is therefore not designated a priority order.Thus, orders B to D may be allocated up to the maximum quantity of fifty(50) lots assuming that the initial contra order(s) includes asufficient quantity for this allocation.

FIG. 13B relates to table 1300 shown in FIG. 13A. In particular, FIG.13B illustrates a table 1310 that expands on the table 1300 and includesan order E that improves the market price. Order E may be designated asa priority order because it improves the market price and satisfies theminimum quantity requirements. Orders B and C retain the prioritypreviously provided because the market in this example may have as manyas three (3) standing orders that have priority. For the same reason,the priority provided to order D before the receipt of order E may berevoked. In some markets, a predetermined number of orders at the sameprice are given priority. In other markets, a predetermined number oforders at different price levels are given priority.

Column 1312 shows the quantities of the orders B, C, and E that may befilled based on priority. While the orders B and C may retain theirdesignated priority, the trading host may first fill standing orders ata better price before filling the orders B and C even if such standingorders do not have priority.

D. Aging of Order Priority

In one embodiment a matching algorithm may be configured to designate anorder as a priority order if the orders are determined to improve themarket, and the priority is maintained and associated with the restingorder for a predetermined period of time before expiring.

In an embodiment, orders may be designated priority orders for a periodof time or a specific duration or until the occurrence of a predefinedevent such as, for example, the close of the market. After expiration ofthe period of time, the designated priority may be revoked. In anotherembodiment, priority designations for all orders may be revoked after aperiod of time or duration. For example, the period of time may beginwhen an initial (first) order is designated as a priority order. Theperiod of time may be fixed for the market (e.g., 30 seconds, 10milliseconds) or may be dynamic and adjusted in accordance with marketactivity. Alternatively or in addition to, the period of time may varyby market and in some markets the period of time may be a sub-secondinterval.

FIGS. 14A and 14B illustrate the aging of order priorities.Specifically, FIG. 14A shows a table 1400 of standing orders A to D in amarket at a time 10:00:04, wherein orders A to C, the first three (3)orders, were received at 10:00:01, 10:00:02, and 10:00:03, respectively.Orders A to C have been designated priority orders and allocated lotsaccordingly (as shown in column 1402). The examples illustrated in FIGS.14A and 14B require no minimum quantity to receive priority or cap themaximum quantity of the lots within an order that may be filled inaccordance with the designated priority. FIG. 14B shows a table 1404that illustrates the status of the standing orders A to D at a time10:01:04. Column 1406 illustrates an embodiment in which the prioritydesignation associated with the orders A to C are revoked after a periodof time, in this case after one (1) minute.

E. Priority Including FIFO/Pro-Rata and Min/Max Quantity

In one embodiment a matching algorithm may be configured to designate anorder as a priority order if the order is determined to improve themarket and/or satisfy a minimum order quantity. The priority order mayhave lots allocated to it according to FIFO principle up to a maximumquantity.

FIG. 15 illustrates a table 1500 that represent a plurality of standingorders A to G in an exemplary market. For example, it may be assumedthat (1) the orders A to G are sorted by the time each order wasreceived; (2) order A was received first, and (3) order A improved themarket. Furthermore, it may be assumed that the market (1) utilizes avalue of FIFO_(percent) of thirty percent (30%); (2) designates two (2)market improving orders as priority orders; (3) requires a minimum orderquantity of twenty (20) lots; and (4) limits or caps the quantity of anorder that may be allocated on the basis of the priority to fifty (50)lots. The market may further round down allocations based on the use ofa pro-rata algorithm. The market illustrated by table 1500 may provide apreference to the traders who submitted orders C and E. In particular,order C may be entitled to an allocation of up to ten-percent (10%) of aquantity of the incoming order that remains after priority allocation.Similarly, order E may be entitled to receive up to five-percent (5%) ofthe quantity of the incoming order that remains after allocation of theincoming order to any orders that have priority.

For example, turning to the table 1500 shown in FIG. 15, it may beassumed that the trading host receives an order to sell five hundred(500) lots at 111.01, and that the orders A to G are orders, within thesame market, to buy five hundred and seventy-eight (578). It may befurther assumed that each of orders A to G has an identical bid pricethat is better than or equal to 111.01.

Column 1502 indicates that orders A and B are designated priority ordersand are allocated fifty (50) and thirty (30) lots, respectively, of theincoming order. Order A requests eighty (80) lots, however the marketcaps priority allocations to fifty (50).

The quantity of the incoming order that remains after the priorityallocation is four hundred and twenty (420) lots. Therefore, orders Cand E are allocated forty-two (42) lots and twenty-one (21) lots,respectively, because of the provided ten-percent (10%) and five-percent(5%) allocations (see column 1504).

The quantity of the original incoming order remaining after thepreference allocation is three hundred and fifty-seven (357) lots. Ofthe three hundred and fifty-seven (357) lots, the FIFO_(percent) ofthirty percent (30%) or one-hundred and seven lots (107) may beallocated utilizing a FIFO algorithm. In this example, theFIFO_(percent) of lots to be allocated is rounded down. It will beunderstood that the FIFO_(percent) of lots to be allocated may berounded up (to one-hundred and eight lots (108) in this example).

Column 1506 shows the allocation to each order A, C and D (order B wascompletely filed via the priority allocation). Column 1508 shows thatthree hundred and twenty-eight (328) lots remain to be filled. Thequantity of the incoming that remains to be allocated is two hundred andfifty (250) lots. Column 1510 shows the allocation of three hundred andtwenty-eight (328) lots represented by the quantity allocated to eachorder D to G. Column 1512 shows the allocation of the remaining twohundred and fifty (250) lots in accordance with the pro-rata proportion.Because the pro-rata algorithm used by this market rounds downfractional allocation quantities, 2 lots remain to be allocated andthese are allocated on a FIFO basis to order D as shown in a column1514.

Although the embodiments and examples described above illustrate the useof a FIFO_(percent) value to determine the number of contracts that areallocated using the FIFO algorithm, it should be apparent that aProRata_(percent) value may be used instead to determine the number ofcontracts that are allocated using the pro-rata algorithm. Furthermore,an incoming order may be allocated in accordance with the pro-rataalgorithm first and then any quantity that remains thereafter may beallocated using the FIFO algorithm. In addition the incoming order maybe allocated to standing contra orders using a combination of FIFO,pro-rata, multiple priority and multiple preferencing algorithms. Suchalgorithms may be combined with other allocation and order selectionalgorithms that may be apparent to those with skill in the art.

III. Inner/Outer Market Allocation

In one embodiment a matching algorithm may be configured to identify aninner market and an outer market. Incoming orders within a marketparameter, e.g., five (5) ticks, are identified as inner market ordersand have lots allocated to them based on FIFO principles. All remainingorders are identified as outer market orders and have lots allocated tothem based on pro-rata principles.

FIG. 16A Illustrates an inner/outer market allocation algorithm 1600,the teaching and disclosure of which may be implemented at or inconjunction with the block 524 (see FIG. 5) of the FIFO matchingalgorithm 500. The inner/outer market allocation algorithm 1600 detailsanother matching or allocation scheme for segmenting orders anddistributing or allocating contra orders represented by the value ofQ_(remaining) according an inner market parameter IM_(parameter). Forexample, in one embodiment, the inner/outer market allocation algorithm1600 may include an IM_(parameter) set to equal five (5) ticks. Inparticular, the inner/outer market allocation algorithm 1600 identifiesorders, within a predefined range e.g., within five (5) ticks betweenthe contra bids and orders.

The identified orders, in turn, may be designated as priority orderswhich represent an inner market. All other, undesignated orders mayrepresent the outer market. The inner market parameter IM_(parameter)may be adjusted or defined based, for example, on market volatility. Ina volatile market, IM_(parameter) may be a large value to account largechanges in the market. Conversely, in a stable or more stable market,IM_(parameter) may be a smaller value because the changes may be lesssevere. Alternatively, IM_(parameter) may be adjusted throughout aperiod of time, for example, a trading session, in response to thevolume of the market.

In another embodiment, the inner market parameter IM_(parameter) may bethe two (2) orders with the highest bid or value resting within theorder book. In this example, the orders corresponding with the twohighest bids may be designated as priority orders. As the highest bidchanges over time, the two (2) orders allowed by IM_(parameter) maychange and vary. Regardless of the value or variable represented by theinner market parameter IM_(parameter), the inner/outer market allocationalgorithm 1600 may be configured to allocate lots to inner market ordersaccording to FIFO principles, while allocating lots to the remaining orouter market orders according to pro-rata principle.

Returning to FIG. 16A, the disclosed inner/outer market allocationalgorithm 1600 is assumed to be operable in connection with an existingmarket and order book such as, for example, the market discussed inconnection with blocks 502 to 516 shown in FIG. 5. At block 1602, theinner/outer market allocation algorithm 1600 may receive a new orderwhich in this present embodiment may be an offer to sell a plurality oflots Q_(order).

At block 1604, the quantity of lots remaining to be filled or allocatedQ_(remaining) may be set to include or equal the plurality of lotsQ_(order) plus any residual lots associated with Q_(remaining). Thequantity Q_(remaining) may include any quantity of lots remaining fromprevious implementations of the inner/outer market allocation algorithm1600.

At block 1606, the price associated with Q_(order) may be evaluatedagainst the inner market parameter IM_(parameter) that may be, forexample, two (2) ticks between the bid and offer spread of contraorders. If the price associated with Q_(order) is within the rangedefining the inner market, then the inner/outer market allocationalgorithm 1600 may proceed along the path indicated by the arrow A.Alternatively, if the price associated with Q_(order) is outside therange defining the inner market, then the inner/outer market allocationalgorithm 1600 may proceed along the path indicated by the arrow B.

At block 1608, a predetermined number of incoming orders may beidentified and designated priority orders based on the price associatedtherewith. In particular and for example, the first five orders thatfall within two (2) ticks of the bid/order spread.

At block 1610, the quantity of lots remaining to be filled or allocatedQ_(remaining) may be allocated to the designated priority ordersutilizing FIFO principles. The number of lots allocated to all of thedesignated priority orders, i.e. all of the inner market orders, may beidentified as Q_(FIFO).

At block 1612, the quantity of lots remaining to be filled or allocatedQ_(remaining) may be updated by subtracting the number of lots allocatedutilizing FIFO principles Q_(FIFO) from the original quantity of lotsremaining to be filled or allocated Q_(remaining) set at block 1604.

At block 1614, received orders having a price associated with Q_(order)that is outside the range defining the inner market less than or equalto the current high market price (as determined at block 1606) and/orthe quantity of lots remaining to be filled or allocated Q_(remaining),may be allocated to the remaining orders within the order book accordingto pro-rata principles.

FIGS. 16B and 16C show tables 1640/1640′ and 1680/1680′, respectively.In particular, the tables 1640 and 1680 illustrates multiple offers andbids corresponding to the orders A to H in a market organized andoperable according to the inner/outer market allocation algorithm 1600discussed above.

FIG. 16B shows the tables 1640 and 1640′ which, in turn, depict theallocation of lots to contra orders A to H according to the inner/outermarket allocation algorithm 1600. In particular, columns 1642 and 1644of table 1640 show time and prices associated with each of the orders Ato H. Columns 1646 and 1648 show the contra bids and offers at a timeinterval one (1), the corresponding time intervals are indicated by thecolumn heading “QTY @ Time 1”. Similarly, columns 1650 and 1652 of table1640′ show the contra bids and offers at a time interval two (2), thecorresponding time intervals are indicated by the column heading “QTY @Time 2”.

The bids, at time interval 1, associated with orders D and E may bedesignated priority orders because at prices 111.05 and 111.04,respectively, they are within two (2) ticks of the nearest offer, i.e.,they are within two (2) ticks of bid/offer spread. As new orders arereceived, the designated priority orders D and E may be filled orotherwise allocated lots according to FIFO principles. The remainingunallocated quantity Q_(remaining) from the example above, may beallocated according to pro-rata principles.

The bids, at time interval 2, associated with orders F and G maydesignated priority orders because at prices 111.03 and 111.02,respectively, they are within two (2) ticks of the nearest offer, i.e.,they are within two (2) ticks of bid/offer spread. As new orders arereceived, the designated priority orders F and G may be filled orotherwise allocated lots according to FIFO principles. The remainingunallocated quantity Q_(remaining) from the example above may beallocated according to pro-rata principles.

It will be understood that many variations and alterations may beimplemented to further refine the allocation of lots according to theinner/outer market allocation algorithm 1600. For example, the prioritydesignation may or may not be a time-sensitive priority designation. If,for example, the priority designation associated with orders D and Ewere not a time-sensitive priority designation, these orders will retainpriority over, and be allocated lots before, the priority designationassociated with orders F and G. Thus, in operation, the priority ordersD and E may be receive a priority allocation according to FIFOprinciples and orders F to H may receive an allocation according topro-rata principles. The priority orders D and E may retain thispriority until they have been filled or otherwise received their maximumallocation, and then the priority orders F and H may begin to receivetheir priority allocation until they have been filled or otherwisereceived their maximum allocation. In another variation, the FIFOprinciples utilized to allocate lots to priority orders may include, forexample, FIFO_(percentage) to limit or otherwise govern the maximumvolume or quantity allocated.

If, for example, the priority designation associated with orders D and Ewere a time-sensitive priority designation, these orders will retainpriority over, and be allocated lots before, for a given period and thenmay lose their priority designation to the orders F and G. At thispoint, and Q_(remaining) associated with orders D and E may be, unlessre-designated priority at a later time period, be allocated according topro-rata principles. In yet another variation, a minimum order volume orlimit Q_(min) may be established at, for example, five (5) lots. In thisexample, the order D may no longer be eligible for FIFO allocation andmay, instead, be allocated according to pro-rata principles.

FIG. 16C shows the tables 1680 and 1680′ which, in turn, depict theallocation of lots to contra orders A to H according to the inner/outermarket allocation algorithm 1600. In particular, columns 1642 and 1644show time and prices associated with each of the orders A to H. Columns1682 and 1684 of table 1680 show the contra bids and offers at a timeinterval one (1), the corresponding time intervals are indicated by thecolumn heading “QTY @ Time 1”. Similarly, columns 1686 and 1688 of table1680′ show the contra bids and offers at a time interval two (2), thecorresponding time intervals are indicated by the column heading “QTY @Time 2”.

The bids, at time interval 1, associated with orders D and F maydesignated priority orders because at prices 111.05 and 111.03,respectively, they represent the best or highest, i.e, the ordersrepresenting the greatest risk, standing bids within the order book. Asnew orders are received, the designated priority orders D and E may befilled or otherwise allocated lots according to FIFO principles. Theremaining unallocated quantity Q_(remaining) from the example above, maybe allocated according to pro-rata principles.

The bids, at time interval 2, associated with orders E and F may bedesignated priority orders because at prices 111.04 and 111.03,respectively, they now represent the best or highest standing bidswithin the order book. As new orders are received, the designatedpriority orders E and F may be filled or otherwise allocated lotsaccording to FIFO principles. The remaining unallocated quantityQ_(remaining) from the example above may be allocated according topro-rata principles.

IV. Priority Pro-Rata with Multiple Order Priority

In one embodiment a matching algorithm may be configured to designate apredefined number of orders as priority orders and lots may be allocatedto these priority orders according to pro-rata principles.

FIG. 17 Illustrates a priority pro-rata allocation algorithm 1700, theteaching and disclosure of which may be implemented at or in conjunctionwith the block 524 (see FIG. 5) of the FIFO matching algorithm 500. Thepriority pro-rata allocation algorithm 1700 details another matching orallocation scheme for allocating or distributing Q_(remaining) accordingto maximum volume cap. For example, in one embodiment, the prioritypro-rata allocation algorithm 1700 may designate the first one-thousand(1000) lots or contracts as priority lots or contracts. The prioritylots or contracts may, in turn, be allocated according to pro-rataprinciples. In an embodiment, if the quantity of an order that includesone or more of the priority contracts is reduced during the pro-rataallocation process, the order and/or the lots may retain priority. Inanother embodiment, the first one-thousand (1000) lots or contractsdesignated as priority lots or contracts may be determined based on theinitial volume or initial number of lots or contracts, as opposed to avolume that could include subsequent new orders.

Returning to FIG. 17, the disclosed priority pro-rata allocationalgorithm 1700 is assumed to be operable in connection with an existingmarket and order book such as, for example, the market discussed inconnection with blocks 502 to 516 shown in FIG. 5. At block 1702, thepriority pro-rata allocation algorithm 1700 may receive a new orderwhich in this present embodiment may be an offer to sell a plurality oflots Q_(order).

At block 1704, the total number of lots or contracts Q_(total) pendingwithin an order book for a given market may be updated. For example, theplurality of lots Q_(order) may be added to the current total number oflots or contracts Q_(total) to determine a new value for Q_(total). Thevalue of Q_(total) represents the total number of lots, regardless ofthe associated orders, that satisfy a given criterion such as price,time, etc.

At block 1706, the priority pro-rata allocation algorithm 1700 mayevaluate the total number of lots or contracts Q_(total) with respect toa maximum volume or quantity cap or limit Q_(cap). For example, Q_(cap)may be defined to equal one-thousand (1000) lots or contracts. Thus, ifQ_(total) is greater than Q_(cap), that is, if total number of lots orcontracts in an order book exceeds one-thousand, then the prioritypro-rata allocation algorithm 1700 may proceed along the path indicatedby the arrow A to the block 1716. If Q_(total) is less than or equal toQ_(cap), then the priority pro-rata allocation algorithm 1700 mayproceed to the block 1708.

At block 1708, the priority pro-rata allocation algorithm 1700 mayevaluate the total number of lots or contracts Q_(total) with respect toa minimum order volume or limit Q_(min). If Q_(order) is less thanQ_(min), that is, if number of lots or contracts in the received orderbooks is less than a minimum amount, then the priority pro-rataallocation algorithm 1700 may proceed along the path indicated by thearrow B to the block 1716. If Q_(order) is greater than or equal toQ_(min), then the priority pro-rata allocation algorithm 1700 mayproceed to the block 1710.

At block 1710, the lots of contracts, under the one-thousand lot limit,in the received order Q_(order) may be identified or designated aspriority lots or contracts.

At block 1712, priority orders, i.e., orders in include the firstone-thousand lots or contracts may be filled first according to pro-rataprinciples Q_(prorata). If any lots or contracts within one or more ofthe orders remain unfilled after the pro-rata allocation, these lots orcontracts may retain priority until they are filled.

At block 1714, the quantity of lots remaining to be filled or allocatedQ_(remaining) may be updated by subtracting the number of lots allocatedutilizing pro-rata principles Q_(prorata) from the original quantity oflots remaining to be filled or allocated Q_(remaining).

At block 1716, the quantity of lots remaining to be filled or allocatedQ_(remaining) may be allocated to the remaining orders within the orderbook according to FIFO, pro-rata or any other known allocationprinciples or variations thereof.

At block 1718, the priority pro-rata allocation algorithm 1700 may waitfor new incoming orders and proceed along the path indicated by thearrow C to the block 1702 upon receipt of a new order.

V. Multi-Level Allocation

In one embodiment a matching algorithm segment all of the resting ordersand each segment may, in turn, be allocated lots according to adifferent principle. For example, one segment may be allocated lotsaccording to FIFO principles, another segment according to pro-rataprinciples.

FIG. 18 Illustrates a multi-level allocation algorithm 1800, theteaching and disclosure of which may be implemented in connection withan existing market and order book such as, for example, the marketdiscussed in connection with blocks 502 to 516 shown in FIG. 5. Themulti-level allocation algorithm 1800 details another matching orallocation scheme for segmenting orders and distributing or allocatingcontra orders represented by the value of Q_(remaining) according one ormore parameters or criteria.

At block 1802, the multi-level allocation algorithm 1800 may receive anew order which in this present embodiment may be an offer to sell aplurality of lots Q_(order).

At block 1804, the existing order book may be evaluated and organized,for example, any quantity of lots remaining to be filled or allocatedQ_(remaining) may be set to include or equal the plurality of lotsQ_(order). The quantity Q_(remaining) may include any quantity of lotsremaining from previous implementations of the multi-level allocationalgorithm 1800. The existing order book may be further evaluated andorganized into multiple levels or segments. For example, in oneembodiment, (I) the first five (5) orders at a new high market price maybe assigned to a first (1^(st)) segment or level; (II) the remainingreceived orders or standing orders Q_(remaining) having a minimum ordervolume or limit Q_(min) above a predetermined quantity may be assignedto a second (2^(nd)) segment or level; and (III) all other orders notallocated to first and second segments may be assigned to a third(3^(rd)) segment or level. It will be understood that orders may besegmented based on a variety of criteria, for example, orders may beassigned to second segment if they are orders having a price within apredefined number of ticks bid/order spread; if they are orders for agiven quantity of lots; if they were received within a given timeperiod, etc.

At block 1806, the first segment may be evaluated to determine ifQ_(remaining) associated therewith is greater than zero (0) indicatingexistence of orders within the first segment waiting to be filled, e.g.,receive an allocation of lots. If Q_(remaining) is greater than zero, atblock 1808, the orders within the first segment may be designated aspriority orders and allocated lots according to the priority. Theallocation may be accomplished according to any known allocationprinciple, algorithm or technique. At block 1810, Q_(remaining) may beupdated to reflect the allocation of orders.

At block 1812, the second segment may be evaluated to determine ifQ_(remaining) associated therewith is greater than zero (0) indicatingexistence of orders within the first segment waiting to be filled, e.g.,receive an allocation of lots. In particular, if Q_(remaining) equaledzero (0) at block 1806 or another value at block 1810, then the value ofQ_(remaining) may be evaluated at block 1812. If Q_(remaining) isgreater than zero (0), at block 1814, the orders within the firstsegment may be designated as priority orders and allocated lotsaccording to the pro-rata principles. Alternatively, the allocation maybe accomplished according to any know allocation principle, algorithm ortechnique. At block 1816, Q_(remaining) may be updated to reflect theallocation of orders.

At block 1818, the third segment may be evaluated to determine ifQ_(remaining) associated therewith is greater than zero (0) indicatingexistence of orders within the first segment waiting to be filled, e.g.,receive an allocation of lots. In particular, if Q_(remaining) equaledzero (0) at block 1812 or another value at block 1816, then the value ofQ_(remaining) may be evaluated at block 1818. If Q_(remaining) isgreater than zero (0), at block 1820, the orders within the firstsegment may be designated as priority orders and allocated lotsaccording to the FIFO principles. Alternatively, the allocation may beaccomplished according to any know allocation principle, algorithm ortechnique.

At block 1822, Q_(remaining) may be updated to reflect the allocation oforders.

At block 1824, the multi-level allocation algorithm 1800 may wait fornew incoming orders and proceed to the block 1802 upon receipt of a neworder.

VI. Multiple Order Priority Allocation

In one embodiment a matching algorithm may be configured to designate apredefined number of orders as priority orders if the orders aredetermined to improve the market.

FIG. 19 Illustrates a multiple order priority algorithm 1900, theteaching and disclosure of which may be implemented in connection withan existing market and order book such as, for example, the marketdiscussed in connection with blocks 502 to 516 shown in FIG. 5. Themultiple order priority algorithm 1900 details another matching orallocation scheme for segmenting orders and distributing or allocatingcontra orders represented by the value of Q_(remaining) according one ormore parameters or criteria.

At block 1902, the multiple order priority algorithm 1900 may receive anew order which in this present embodiment may be an offer to sell aplurality of lots Q_(order).

At block 1904, the existing order book may be evaluated and organized,for example, any the quantity of lots remaining to be filled orallocated Q_(remaining) may be set to include or equal the plurality oflots Q_(order). The quantity Q_(remaining) may include any quantity oflots remaining from previous implementations of the multiple orderpriority algorithm 1900. In one embodiment, for example, the first five(5) orders at a new high market price may be identified and designatedas priority orders. It will be understood that orders may be identifiedbased on a variety of criteria, for example, orders may be identifiedbased on the value of Q_(order); a period of time in which the order wasreceived, etc.

At block 1906, the orders within the order book may be evaluated todetermine whether or not each order has been designated as a priorityorder. If, for example, Q_(remaining) includes one or more of thedesignated priority orders, then at block 1908, the priority orders (thefirst five (5) orders at a new high market price in the present example,may be allocated lots according to the priority. The allocation may beaccomplished according to any know allocation principle, algorithm ortechnique. At block 1910, Q_(remaining) may be updated to reflect theallocation of orders.

At block 1912, if Q_(remaining) did not include one or more of thedesignated priority orders or includes another value provided by theblock 1810, then the lots associated with Q_(remaining) may be allocatedin accordance with pro-rata principles.

At block 1914, Q_(remaining) may be updated to reflect the allocation oforders.

At block 1916, the multiple order priority algorithm 1900 may wait fornew incoming orders and proceed to the block 1902 upon receipt of a neworder.

VII. Timed Order Priority Allocation

In one embodiment a matching algorithm may be configured to designate apredefined number of orders as priority orders if the orders arereceived within a given period of time. Order that are not receivedwithin the given period of time are distributed according to pro-rataprinciples.

FIG. 20 Illustrates a timed order priority algorithm 2000, the teachingand disclosure of which may be implemented in connection with anexisting market and order book such as, for example, the marketdiscussed in connection with blocks 502 to 516 shown in FIG. 5. Thetimed order priority algorithm 2000 details another matching orallocation scheme for segmenting orders and distributing or allocatingcontra orders represented by the value of Q_(remaining) according one ormore timing parameters or criteria.

At block 2002, the timed order priority algorithm 2000 may receive a neworder which in this present embodiment may be an offer to sell aplurality of lots Q_(order).

At block 2004, the quantity of lots remaining to be filled or allocatedQ_(remaining) may be set to include or equal the plurality of lotsQ_(order). The quantity Q_(remaining) may include any quantity of lotsremaining from previous implementations of the timed order priorityalgorithm 2000.

At block 2006, the price associated with Q_(order) may be evaluated todetermine if it represents the new low price for the market. If theprice is determined to be the new low market price, then at block 2008,Q_(order) may be designated as a priority order and a may be activated.The timer may be set for any time or priority period, for example,thirty (30) seconds, one (1) minute, etc.

At block 2010, the timed order priority algorithm 2000 may allocate newlots from contra received orders to satisfy or fill Q_(order). Forexample, during the time or priority period, the timed order priorityalgorithm 2000 may allocate lots based on FIFO principles.

At block 2012, Q_(remaining) may be updated to reflect the allocation oforders.

At block 2014, the predefined time or priority period may be evaluatedagainst the elapsed time (initiated at block 2008) to determine if thepriority period has ended. If the priority period has not ended, timedorder priority algorithm 2000 may return to the block 2010.

At block 2016, if Q_(order) was not associated with a new low marketprice as determined at block 2006 or the priority period has ended asdetermined at block 2014, then any lots associated with Q_(remaining)may be allocated in accordance with pro-rata principles.

At block 2018, Q_(remaining) may be updated to reflect the allocation oforders.

At block 2020, the timed order priority algorithm 2000 may wait for newincoming orders and proceed to the block 2002 upon receipt of a neworder.

The trading methods, allocation algorithms and variants thereofgenerally relate to information processing and optimization. Inparticular, the disclosed trading methods and allocation algorithmsembody methods and processes for allocating resources based on criteriasuch as, for example, price, quantity, time of receipt, etc.

FIG. 21A illustrates one embodiment of a system 2100 configured toimplement one or more of the disclosed trading methods, allocationalgorithms, etc. The system 2100 may include multiple terminals 2102 to2108 directly and/or indirectly in communication with an ordermanagement terminal 2110. For example, the terminals 2102 and 2104 maycommunicate with the order management terminal 2110 via the Internet2112, a wide area network (WAN) and/or other communication network. Theterminals 2106 and 2108 may communicate with the order managementterminal 2110 via for example a communication network 2114 such as anEthernet network, a wireless fidelity (WiFi) network and/or othercommunication network. The order management terminal 2110 may, in turn,be in communication with a database 2116 or other memory or storagedevice or medium. The database 2116 may be configured to store, in anaccessible manner, the information, algorithms, parameters, etc.necessary to implement and monitor the trading methods, allocationalgorithms disclosed herein. The database 2116 may be a separate deviceor logical construct or may be a portion of the order managementterminal 2110.

FIG. 21B illustrates one example of a logical configuration that may beimplemented in the order management terminal 2110. For example, theorder management terminal 2110 may include a communication module 2118and a memory 2120 in communication with a processor 2124 via acommunication bus 2122. The memory 2120 may include RAM, ROM, flashmemory, or any other type of known storage medium. Moreover, the memory2120 may include the database 2116 stored thereon. The communicationmodule 2118 may be a wireless communication module or may be a wiredcommunication module.

The processor 2124 may be a general purpose processor configured toexecute the disclosed trading methods and allocation algorithms.Alternatively, the processor 2124 may represent one or more applicationspecific processor or modules 2124 a to 2124 c. For example, the module2124 a may be a FIFO allocation module or processor; the module 2124 bmay be a pro-rata allocation module or processor; and the module 2124 cmay be a tracking module or processor for processing and updating theorder status associated with each method and/or algorithm.

It should be understood that various changes and modifications to thepresently preferred embodiments described herein will be apparent tothose skilled in the art. Such changes and modifications can be madewithout departing from the spirit and scope of the present invention andwithout diminishing its intended advantages. It is therefore intendedthat such changes and modifications be covered by the appended claims.

What is claimed is:
 1. A method of order allocation, the methodcomprising: establishing, utilizing software executable by a processor,a first order segment having a first criteria, wherein the first ordersegment is a first portion of an order book; establishing, via theprocessor, a second order segment having a second criteria that isdifferent than the first criteria, wherein the second order segment is asecond portion of the order book that is different than the firstportion; establishing, via the processor, a third order segment, whereinthe third order segment is a third portion of the order book;designating, via the processor, the first order segment as a priorityportion; allocating, via the processor, a quantity of an incoming orderto the priority portion utilizing a first allocation algorithm; andallocating, via the processor, any remaining quantity of the incomingorder portion utilizing a second allocation algorithm.
 2. The method ofclaim 1, wherein the first allocation algorithm is a priority allocationalgorithm.
 3. The method of claim 1, wherein the second allocationalgorithm is a pro-rata allocation algorithm.
 4. The method of claim 3,wherein the pro-rata allocation algorithm includes a pro-rata percentageto determine the percentage of the incoming order to be allocatedaccording to the pro-rata allocation algorithm.
 5. The method of claim 1further comprising: allocating, via the processor, any remainingquantity of the incoming order portion utilizing a third allocationalgorithm.
 6. The method of claim 5, wherein the third allocationalgorithm is a first-in, first-out (FIFO) allocation algorithm.
 7. Themethod of claim 6, wherein the FIFO allocation algorithm includes a FIFOpercentage to determine the percentage of the incoming order to beallocated according to the FIFO algorithm.
 8. A trading systemconfigured for the matching and allocation of orders, the systemcomprising: a memory, wherein the memory is configured to store computerreadable instructions; a processor in communication with the memory, theprocessor configured to execute the computer readable instructions,wherein the computer readable instructions are programmed to: establisha first order segment having a first criteria, wherein the first ordersegment is a first portion of an order book; establish a second ordersegment having a second criteria that is different than the firstcriteria, wherein the second order segment is a second portion of theorder book that is different than the first portion; establish a thirdorder segment, wherein the third order segment is a third portion of theorder book; designate the first order segment as a priority portion;allocate a quantity of an incoming order to the priority portionutilizing a first allocation algorithm; and allocate any remainingquantity of the incoming order portion utilizing a second allocationalgorithm.
 9. The system of claim 8, wherein the first allocationalgorithm is a priority allocation algorithm.
 10. The system of claim 8,wherein the second allocation algorithm is a pro-rata allocationalgorithm.
 11. The system of claim 10, wherein the pro-rata allocationalgorithm includes a pro-rata percentage to determine the percentage ofthe incoming order to be allocated according to the pro-rata allocationalgorithm.
 12. The system of claim 8, wherein the computer readableinstructions are further programmed to: allocate any remaining quantityof the incoming order portion utilizing a third allocation algorithm.13. The system of claim 12, wherein the third allocation algorithm is afirst-in, first-out (FIFO) allocation algorithm.
 14. The system of claim13, wherein the FIFO allocation algorithm includes a FIFO percentage todetermine the percentage of the incoming order to be allocated accordingto the FIFO algorithm.
 15. A method of order allocation, the methodcomprising: establishing, utilizing software executable by a processor,a first order segment having a first criteria, wherein the first ordersegment is a first portion of an order book; establishing, via theprocessor, a second order segment having a second criteria that isdifferent than the first criteria, wherein the second order segment is asecond portion of the order book that is different than the firstportion; establishing, via the processor, a third order segment, whereinthe third order segment is a third portion of the order book;designating, via the processor, the first order segment as a priorityportion; receiving, via the processor, an incoming order; analyzing, viathe processor, the incoming order as a function of the first and secondcriteria; assigning, via the processor, the received incoming order toone of the first, second or third segments; allocating, via theprocessor, a quantity of a second incoming order to the priority portionutilizing a priority allocation algorithm; allocating, via theprocessor, a first remaining quantity of the second incoming orderportion utilizing a pro-rata allocation algorithm; and allocating, viathe processor, a second remaining quantity of the second incoming orderportion utilizing a first-in, first-out (FIFO) allocation algorithm. 16.The method of claim 15, wherein the pro-rata allocation algorithmincludes a pro-rata percentage to determine the percentage of theincoming order to be allocated according to the pro-rata allocationalgorithm.
 17. The method of claim 15, wherein the FIFO allocationalgorithm includes a FIFO percentage to determine the percentage of theincoming order to be allocated according to the FIFO algorithm.
 18. Thesystem of claim 15, wherein the second incoming order represents afutures contract.
 19. The system of claim 15, wherein the secondincoming order represents an option.
 20. The system of claim 15, whereinthe order books represents the orders within an over-the-counter market.